Analysis of two-dimensional approximate pattern matching algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact and Approximate Two Dimensional Pattern Matching allowing Rotations

We give fast ltering algorithms for searching a 2{dimensional pattern in a 2{dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under several matching models, improving the previous results. For a text of size n n character and a pattern of size m m characters, the exact matching takes average time O(n 2 =m). If we allow k{mismatches o...

متن کامل

Fast Multi-dimensional Approximate Pattern Matching

We address the problem of approximate string matching in d dimensions, that is, to nd a pattern of size m d in a text of size n d with at most k < m d errors (substitutions, insertions and deletions along any dimension). We use a novel and very exible error model, for which there exists only an algorithm to evaluate the similarity between two elements in two dimensions at O(m 4) time. We extend...

متن کامل

Fast Two-Dimensional Pattern Matching

An algorithm for searching for a two dimensional m m pattern in a two dimensional n n text is presented. It performs on the average less comparisons than the size of the text: n 2 =m using m 2 extra space. Basically, it uses multiple string matching on only n=m rows of the text. It runs in at most 2n 2 time and is close to the optimal n 2 time for many patterns. It steadily extends to an alphab...

متن کامل

New Models and Algorithms for Multidimensional Approximate Pattern Matching

We focus on how to compute the edit distance (or similarity) between two images and the problem of approximate string matching in two dimensions, that is, to find a pattern of size m m in a text of size n n with at most k errors (character substitutions, insertions and deletions). Pattern and text are matrices over an alphabet of size . We present new models and give the first sublinear time se...

متن کامل

Approximate input sensitive algorithms for point pattern matching

Article history: Received 31 January 2009 Received in revised form 1 May 2009 Accepted 17 May 2009

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1998

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(97)00277-6